b, F:Top, n, m:. primrec(n+m;b;i.F) ~ primrec(n;primrec(m;b;i.F);i.F) 

latex

ProofTree

Definitions	t  T, x:A. B(x), -n, , s = t, P  Q, False, A, A  B, {x:A| B(x)} , , , Top, {T}, SQType(T), primrec(n;b;c), f(a), b, b, , (i = j), x:AB(x), x:A  B(x), P & Q, P  Q, Unit, left + right, if b then t else f fi , i  j , a < b, Void, #$n, n - m, n+m, s ~ t
Lemmas	ge wf, nat properties, top wf, nat wf, bool wf, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert of eq int, eq int wf, bnot wf, not wf, assert wf